Coverage of a square lattice by an inclined rectangle
نویسندگان
چکیده
منابع مشابه
Lattice points in a rectangle
Basically, what we can try to do is to take the Fourier transform of 1R (the indicator function for the set R), and then use Fourier inversion to show that for each shift t+L of the lattice L, this shift intersects the set R. Actually, it will not quite be enough to take the Fourier transform of just 1R, but instead we will need to work with a smoothed version of 1R in order to make the Fourier...
متن کاملAnchored Rectangle and Square Packings
For points p1, . . . , pn in the unit square [0, 1] , an anchored rectangle packing consists of interior-disjoint axis-aligned empty rectangles r1, . . . , rn ⊆ [0, 1] such that point pi is a corner of the rectangle ri (that is, ri is anchored at pi) for i = 1, . . . , n. We show that for every set of n points in [0, 1], there is an anchored rectangle packing of area at least 7/12 − O(1/n), and...
متن کاملRectangle and Square Representations of Planar Graphs
In the first part of this survey we consider planar graphs that can be represented by a dissections of a rectangle into rectangles. In rectangular drawings the corners of the rectangles represent the vertices. The graph obtained by taking the rectangles as vertices and contacts as edges is the rectangular dual. In visibility graphs and segment contact graphs the vertices correspond to horizonta...
متن کاملNumerical simulation of single bubble rising in vertical and inclined square channel using lattice Boltzmann method
A lattice Boltzmann equation (LBE)model based on the Cahn–Hilliard diffuse interface approach is used to investigate thedynamics of a bubble rising in a vertical and inclined square channelwith large density and viscosity ratios. Deformation parameter D, film thickness d, and terminal velocity Ut of the bubble are interrelated quantities which depend on non-dimensional numbers such as Bond numb...
متن کاملThe Bichromatic Square and Rectangle Problems
We examine a variant of the maximum empty square (or rectangle) problem: Find an axis-aligned square (or rectangle) that contains as many blue points as possible without containing any red points. Let n be the total number of red and blue points. We solve the bichromatic square problem in O(n log n) time and O(n) space. We also solve the bichromatic rectangle problem in O(n log n) time and O(n ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Probability
سال: 1989
ISSN: 0001-8678,1475-6064
DOI: 10.2307/1427644